The λ-calculus in the π-calculus
نویسندگان
چکیده
Mathematical Structures in Computer Science / Volume 21 / Issue 05 / October 2011, pp 943 996 DOI: 10.1017/S0960129511000260, Published online: 19 May 2011 Link to this article: http://journals.cambridge.org/abstract_S0960129511000260 How to cite this article: XIAOJUAN CAI and YUXI FU (2011). The λ-calculus in the π-calculus. Mathematical Structures in Computer Science, 21, pp 943-996 doi:10.1017/S0960129511000260 Request Permissions : Click here
منابع مشابه
Implicative Logic based translations of the λ-calculus into the π-calculus
We study an output-based translation of the λ-calculus with explicit substitution into the synchronous π-calculus – enriched with pairing – that has its origin in mathematical logic, and show that this translation respects reduction. We will define the notion of (explicit) head reduction -which encompasses (explicit) lazy reductionand show that the translation fully represents this reduction in...
متن کاملRewriting Modulo \beta in the \lambda\Pi-Calculus Modulo
The λ Π-calculus Modulo is a variant of the λ -calculus with dependent types where β -conversion is extended with user-defined rewrite rules. It is an expressive logical framework and has been used to encode logics and type systems in a shallow way. Basic properties such as subject reduction or uniqueness of types do not hold in general in the λ Π-calculus Modulo. However, they hold if the rewr...
متن کاملOn the representation of McCarthy’s amb in the π-calculus
We study the encoding of λ[], the call by name λ-calculus enriched with McCarthy’s amb operator, into the π-calculus. Semantically, amb is a challenging operator, for the fairness constraints that it expresses. We prove that, under a certain interpretation of divergence in the λ-calculus (weak divergence), a faithful encoding is impossible. However, with a different interpretation of divergence...
متن کاملFunctions as Session-Typed Processes
We study type-directed encodings of the simply-typed λ-calculus in a session-typed π-calculus. The translations proceed in two steps: standard embeddings of simply-typed λ-calculus in a linear λ-calculus, followed by a standard translation of linear natural deduction to linear sequent calculus. We have shown in prior work how to give a Curry-Howard interpretation of the proofs in the linear seq...
متن کاملCoalgebraic Minimisation of HD-Automata for the π-Calculus in a Polymorphic λ-Calculus
We give a formal definition of HD-automata based on coalgebras. Exploiting such definition we formally specify and implement a minimisation algorithm for HD-automata derived from π-calculus agents. The algorithm is a generalisation of the partition refinement algorithm for classical automata and is specified as a coalgebraic construction defined using λ ∏ , a polymorphic λ-calculus with depende...
متن کاملA Logical Interpretation of the λ-Calculus into the π-Calculus, Preserving Spine Reduction and Types
We define a new, output-based encoding of the λ-calculus into the asynchronous π-calculus – enriched with pairing – that has its origin in mathematical logic, and show that this encoding respects one-step spine-reduction up to substitution, and that normal substitution is respected up to similarity. We will also show that it fully encodes lazy reduction of closed terms, in that termsubstitution...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Mathematical Structures in Computer Science
دوره 21 شماره
صفحات -
تاریخ انتشار 2011